On the Equivalence of Finite Substitutions and Transducers
نویسندگان
چکیده
This paper discusses on several variants of a fascinating problem of deciding whether two nite substitutions are equivalent on a regular language, as well as its relations to the equivalence problems of sequential transducers. Among other things it is proved to be decidable whether for a regular language L and two substitutions ' and , the latter one being a pre x substitution, the relation '(w) (w) holds for all w in L.
منابع مشابه
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable
We show that it is undecidable whether two finite substitutions agree on the binary language a∗b. This in particular means that equivalence of nondeterministic finite transducers is undecidable even for two-state transducers with unary input alphabet and whose all transitions start from the initial state.
متن کاملOn the Equivalence of Weighted Finite-state Transducers
Although they can be topologically different, two distinct transducers may actually recognize the same rational relation. Being able to test the equivalence of transducers allows to implement such operations as incremental minimization and iterative composition. This paper presents an algorithm for testing the equivalence of deterministic weighted finite-state transducers, and outlines an imple...
متن کاملBCK-ALGEBRAS AND HYPER BCK-ALGEBRAS INDUCED BY A DETERMINISTIC FINITE AUTOMATON
In this note first we define a BCK‐algebra on the states of a deterministic finite automaton. Then we show that it is a BCK‐algebra with condition (S) and also it is a positive implicative BCK‐algebra. Then we find some quotient BCK‐algebras of it. After that we introduce a hyper BCK‐algebra on the set of all equivalence classes of an equivalence relation on the states of a deterministic finite...
متن کاملEquivalence of Finite-Valued Symbolic Finite Transducers
Symbolic Finite Transducers, or SFTs, is a representation of finite transducers that annotates transitions with logical formulas to denote sets of concrete transitions. This representation has practical advantages in applications for web security analysis, where it provides ways to succinctly represent web sanitizers that operate on large alphabets. More importantly, the representation is also ...
متن کاملEquivalence of Extended Symbolic Finite Transducers
Symbolic Finite Transducers augment classic transducers with symbolic alphabets represented as parametric theories. Such extension enables succinctness and the use of potentially infinite alphabets while preserving closure and decidability properties. Extended Symbolic Finite Transducers further extend these objects by allowing transitions to read consecutive input elements in a single step. Wh...
متن کامل